By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

ALERT ATTENTION: System maintenance will be performed the weekend of Saturday, March 28, 2009. This event will begin at 6:00 am on March 28 and will conclude at approximately 12:00 noon on Sunday March 29 (all times EDT). Some Scitation services may be affected during this period.
Table of Contents
Search This Issue
Volume 22, Issue 2, pp. 425-847

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs

Reza Akhtar, Tao Jiang, and Zevi Miller

pp. 425-449

BibTeX  Abstract Full Text:  PDF

Polychromatic Colorings of Subcubes of the Hypercube

David Offner

pp. 450-454

BibTeX  Abstract Full Text:  PDF

Matroid Complexity and Nonsuccinct Descriptions

Dillon Mayhew

pp. 455-466

BibTeX  Abstract Full Text:  PDF

On Ramsey Minimal Graphs

V. Rödl and M. Siggers

pp. 467-488

BibTeX  Abstract Full Text:  PDF

Graph-Different Permutations

János Körner, Claudia Malvenuto, and Gábor Simonyi

pp. 489-499

BibTeX  Abstract Full Text:  PDF

Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows

Rong Luo, Rui Xu, Wenan Zang, and Cun-Quan Zhang

pp. 500-519

BibTeX  Abstract Full Text:  PDF

Hamilton Cycles in Random Lifts of Directed Graphs

Prasad Chebolu and Alan Frieze

pp. 520-540

BibTeX  Abstract Full Text:  PDF

Coloring of Triangle-Free Graphs on the Double Torus

Daniel Král' and Matěj StehlÍk

pp. 541-553

BibTeX  Abstract Full Text:  PDF

Power Domination in Product Graphs

Paul Dorbec, Michel Mollard, Sandi Klavžar, and Simon Špacapan

pp. 554-567

BibTeX  Abstract Full Text:  PDF

Planar Graphs of Odd-Girth at Least $9$ are Homomorphic to the Petersen Graph

Z. Dvořák, R. Škrekovski, and T. Valla

pp. 568-591

BibTeX  Abstract Full Text:  PDF

Hat Guessing Games

Steve Butler, Mohammad T. Hajiaghayi, Robert D. Kleinberg, and Tom Leighton

pp. 592-605

BibTeX  Abstract Full Text:  PDF

The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra

Angel Corberán, Isaac Plana, and José M. Sanchis

pp. 606-628

BibTeX  Abstract Full Text:  PDF

On Complexity of the Subpattern Problem

Shlomo Ahal and Yuri Rabinovich

pp. 629-649

BibTeX  Abstract Full Text:  PDF

Cubic Monomial Bent Functions: A Subclass of $\mathcal{M}$

Pascale Charpin and Gohar M. Kyureghyan

pp. 650-665

BibTeX  Abstract Full Text:  PDF

Rank-Width and Well-Quasi-Ordering

Sang-il Oum

pp. 666-682

BibTeX  Abstract Full Text:  PDF

Coloring an Orthogonality Graph

C. D. Godsil and M. W. Newman

pp. 683-692

BibTeX  Abstract Full Text:  PDF

Finding a Maximum Independent Set in a Sparse Random Graph

Uriel Feige and Eran Ofek

pp. 693-718

BibTeX  Abstract Full Text:  PDF

A Census of Small Latin Hypercubes

Brendan D. McKay and Ian M. Wanless

pp. 719-736

BibTeX  Abstract Full Text:  PDF

The Nine Morse Generic Tetrahedra

D. Siersma and M. van Manen

pp. 737-746

BibTeX  Abstract Full Text:  PDF

Walkers on the Cycle and the Grid

J. Díaz, X. Pérez, M. J. Serna, and N. C. Wormald

pp. 747-775

BibTeX  Abstract Full Text:  PDF

Combinatorial Properties of a Rooted Graph Polynomial

David Eisenstat, Gary Gordon, and Amanda Redlich

pp. 776-785

BibTeX  Abstract Full Text:  PDF

Testing Triangle-Freeness in General Graphs

Noga Alon, Tali Kaufman, Michael Krivelevich, and Dana Ron

pp. 786-819

BibTeX  Abstract Full Text:  PDF

A Note On Reed's Conjecture

Landon Rabern

pp. 820-827

BibTeX  Abstract Full Text:  PDF

The Minimum Number of Distinct Areas of Triangles Determined by a Set of $n$ Points in the Plane

Rom Pinchasi

pp. 828-831

BibTeX  Abstract Full Text:  PDF

On the Complexity of Ordered Colorings

Arvind Gupta, Jan van den Heuvel, Ján Maňuch, Ladislav Stacho, and Xiaohong Zhao

pp. 832-847

BibTeX  Abstract Full Text:  PDF